On strong Skolem starters for ℤpq

Skolem Functions for DQBF

We consider the problem of computing Skolem functions for satisfied dependency quantified Boolean formulas (DQBFs). We show how Skolem functions can be obtained from an elimination-based DQBF solver and how to take preprocessing steps into account. The size of the Skolem functions is optimized by don’t-care minimization using Craig interpolants and rewriting techniques. Experiments with our DQB...

Functional Starters for Functional Yogurt

In this study, we investigated the multifunctionality (microbial starters and probiotics) of Lactobacillus plantarum WCFS1 and Lactobacillus plantarum CECT 8328 strains used as microbial starters for the production of yogurt in combination with Lactobacillus delbrueckii ssp. bulgaricus and Streptococcus thermophilus. The ability of the probiotic strains to survive oro-gastrointestinal stresses ...

Skolem fragments

W. V. Quine splits the fundamental question of ontology—What is there?—into two questions: What does a theory say that there is? and What theories ought we adopt? Of these, only the former seems amenable to philosophical treatment. Quine thus attempts to formulate an adequate criterion of ontological commitment. Syntactically, the initially existentially quantified sentences of a theory appear ...

Skolem Machines

The Skolem machine is a Turing-complete machine model where the instructions are first-order formulas of a specific form. We introduce Skolem machines and prove their logical correctness and completeness. Skolem machines compute queries for the Geolog language, a rich fragment of first-order logic. The concepts of Geolog trees and complete Geolog trees are defined, and these tree concepts are u...

Skolem arrays and skolem labellings of ladder graphs